Rockwell Numbers and Rebounding Numbers of Steel Balls
نویسندگان
چکیده
منابع مشابه
Zarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملCovering numbers of $L_p$-balls of convex sets and functions
We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it with weaker integral constraints. The existing results can be recovered as special cases of our results.
متن کاملGenocchi numbers and f-vectors of simplicial balls
The aim of this note is to investigate f -vectors of simplicial balls, especially the relations between interior and boundary faces. For a simplicial ball B we denote by fi(B) the number of i-dimensional faces. The boundary ∂B of B is a simplicial sphere with face numbers fi(∂B). We also define fi(int B) := fi(B) − fi(∂B) although the interior int B of B is not a polyhedral complex. For simplic...
متن کاملEnergy of Graphs, Matroids and Fibonacci Numbers
The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.
متن کاملzarankiewicz numbers and bipartite ramsey numbers
the zarankiewicz number z(b; s) is the maximum size of a subgraph of kb,b which does not contain ks,s as a subgraph. the two-color bipartite ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of kb,b with two colors contains a ks,s in the rst color or a kt,t in the second color.in this work, we design and exploit a computational method for bounding and computin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Japan Institute of Metals
سال: 1942
ISSN: 0021-4876
DOI: 10.2320/jinstmet1937.6.9_457